The multisubset sum problem for finite abelian groups
نویسندگان
چکیده
منابع مشابه
The sum-capture problem for abelian groups
Let G be a finite abelian group, let 0 < α < 1, and let A ⊆ G be a random set of size |G|. We let μ(A) = max B,C:|B|=|C|=|A| |{(a, b, c) ∈ A×B × C : a = b+ c}|. The issue is to determine upper bounds on μ(A) that hold with high probability over the random choice of A. Mennink and Preneel [4] conjecture that μ(A) should be close to |A| (up to possible logarithmic factors in |G|) for α ≤ 1/2 and ...
متن کامل-sum Generators of Finite Abelian Groups
Given a finite Abelian group A and an integer t, 1 ≤ t ≤ A −1, a subset S of A is called a t-sum generator of A if every element of A can be written as the sum of exactly t distinct elements of S. In this paper we investigate the minimal integer M(t, A) such that every set S ⊆ A of size S > M(t, A) is a t-sum generator of A. The value of M(t, A) is completely determined for groups of even order.
متن کاملInverse zero-sum problems in finite Abelian p-groups
— In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which lower and upper bounds are proved in the case of finite Abelian p-groups. Among other consequences, the method that we use here enables us to show that, if we ...
متن کاملTwo zero-sum invariants on finite abelian groups
Let G be an additive finite abelian group with exponent exp(G). Let s(G) (resp. η(G)) be the smallest integer t such that every sequence of t elements (repetition allowed) from G contains a zero-sum subsequence T of length |T | = exp(G) (resp. |T | ∈ [1, exp(G)]). Let H be an arbitrary finite abelian group with exp(H) = m. In this paper, we show that s(Cmn ⊕ H) = η(Cmn ⊕ H) + mn − 1 holds for a...
متن کاملOn Zero-sum Subsequences in Finite Abelian Groups
Let G be a finite abelian group and k ∈ N with k exp(G). Then Ek(G) denotes the smallest integer l ∈ N such that every sequence S ∈ F(G) with |S| ≥ l has a zero-sum subsequence T with k |T |. In this paper we prove that if G = Cn1 ⊕ · · · ⊕ Cnr is a p-group, k ∈ N with k exp(G) and gcd(p, k) = 1, then Ek(G) = ⌊ k k − 1 r ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2015
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.566.0da